Data Hiding in Dna Sequences Based on Table Lookup Substitution

نویسندگان

  • Jin-Shiuh Taur
  • Heng-Yi Lin
  • Hsin-Lun Lee
  • Chin-Wang Tao
چکیده

Hiding secret messages in DNA sequences has become a popular research in recent years. In this paper, we propose an improved algorithm named the Table Lookup Substitution Method (TLSM) to enhance the performance of an existing data hiding method called the substitution method. Moreover, a general form of the TLSM is discussed, which includes the original method as a special case. After that, a Base-t TLSM and an extended TLSM (ETLSM) are proposed to further enhance the TLSM. The Base-t TLSM encodes the secret message with radix t to fully utilize the substitution table. The ETLSM takes additional letters into account to increase the number of selectable substitution tables, which can improve the security of the TLSM remarkably. Compared with the original substitution method, the proposed Base-t ETLSM can significantly improve the cracking probability and the amount of information hidden in the DNA sequence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

الگوریتم کنترل نرخ بیت متغیر ویدئو در سطح گروه تصاویر برای استاندارد فشرده‎سازی H.265

A rate control algorithm at the group of picture (GOP) level is proposed in this paper for variable bit rate applications of the H.265/HEVC video coding standard with buffer constraint. Due to structural changes in the HEVC compared to the previous standards, new rate control algorithms are needed to be designed. In the proposed algorithm, quantization parameter (QP) of each GOP is obtained by ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

Suitability of chaotic iterations schemes using XORshift for security applications

The design and engineering of original cryptographic solutions is a major concern to provide secure information systems. In a previous study, we have described a generator based on chaotic iterations, which uses the well-known XORshift generator. By doing so, we have improved the statistical performances of XORshift and make it behave chaotically, as defined by Devaney. The speed and security o...

متن کامل

Data hiding methods based upon DNA sequences

In this paper, three data hiding methods are proposed, based upon properties of DNA sequences. It is highlighted that DNA sequences possess some interesting properties which can be utilized to hide data. These three methods are: the Insertion Method, the Complementary Pair Method and the Substitution Method. For each method, a reference DNA sequence S is selected and the secret messageM is inco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012